On Cryptographic Chained Puzzles
نویسندگان
چکیده
Cryptographic puzzles provide an elegant solution in combating denial of services attacks. In this paper we introduce the concept of chained puzzles and we define two kinds of chained puzzles: linearly chained puzzles and randomly chained puzzles. These construnstions prove to be very useful in some scenarios, from which the more general is in which a client may choose to solve only some of the puzzles that were sent by the server and gain resources from a server according to the amount of puzzles that he solved.
منابع مشابه
On Chained Cryptographic Puzzles
Cryptographic puzzles provide an elegant solution in combating denial of services attacks. In this paper we introduce the concept of chained cryptographic puzzle. We define two kinds of chained puzzle constructions: linearly chained puzzles and randomly chained puzzles. The first construction prove to be very useful in some scenarios, from which the more general is in which a client may choose ...
متن کاملMitigating Network-Based Denial-of-Service Attacks with Client Puzzles
Over the past few years, denial-of-service (DoS) and distributed denial-of-service (DDoS) attacks have become more of a threat than ever. These attacks are aimed at denying or degrading service for a legitimate user by any means necessary. The need to propose and research novel methods to mitigate them has become a critical research issue in network security. Recently, client puzzle protocols h...
متن کاملImplementation and Performance Analysis of IP-Layer Chained Puzzles
As Distributed Denial-of-Service attacks become more prevalent and sophisticated, a promising new mechanism designed to defeat these attacks is client puzzles. Client puzzles force a computational load on clients before their traffic is forwarded thereby slowing the rate at which a client can inject traffic into the network. Chained puzzles are a type of IP-layer puzzle that require a series of...
متن کاملRevisiting Difficulty Notions for Client Puzzles and DoS Resilience
Cryptographic puzzles are moderately difficult problems that can be solved by investing non-trivial amounts of computation and/or storage. Devising models for cryptographic puzzles has only recently started to receive attention from the cryptographic community as a first step towards rigorous models and proofs of security of applications that employ them (e.g. Denial-of-service (DoS) resistance...
متن کاملRegular Ldpc Codes
We propose a method to recover the structure of a randomly permuted chained code and how to cryptanalyse cryptographic schemes based on these kinds of error coding. As application of these methods is a cryptographic schema using regular Low Density Parity Check (LDPC) Codes. This result prohibits the use of chained code and particularly regular LDPC codes on cryptography.
متن کامل